Interpolation Algorithm for Quantifier Formulas in LIUF Theory
نویسندگان
چکیده
منابع مشابه
Rewriting-based Quantifier-free Interpolation for a Theory of Arrays
The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifier-free interpolants in general. In this paper, we show that, with a minor extension to the theory of arrays, it is possible to obtain ...
متن کاملQuantifier-Free Interpolation of a Theory of Arrays
The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifierfree interpolants in general. In this paper, we show that it is possible to obtain quantifier-free interpolants for a Skolemized vers...
متن کاملOn Quantifier Shifting for Quantified Boolean Formulas∗
Since most currently available solvers for quantified Boolean formulas (QBFs) process only input formulas in prenex normal form, suitable translations are required for handling arbitrary formulas. In this paper, we propose a normal form translation incorporating a certain anti-prenexing step in order to obtain QBFs possessing quantifier prefixes such that the number of alternating quantifiers i...
متن کاملCraig Interpolation for Quantifier-Free Presburger Arithmetic
Craig interpolation has become a versatile algorithmic tool for improving software verification. Interpolants can, for instance, accelerate the convergence of fixpoint computations for infinite-state systems. They also help improve the refinement of iteratively computed lazy abstractions. Efficient interpolation procedures have been presented only for a few theories. In this paper, we introduce...
متن کاملConstructing Craig Interpolation Formulas
1 Background and Introduction Let 27 and H be two inconsistent first order theories. Then by Craig's Interpolation Theorem, there is a sentence 8, called a Craig interpolant, such that 8 is t rue in 27 and false in H and every nonlogical symbol occurring in 8 occurs in bo th 27 and H. Craig interpolants can be used to solve the problem of learning a first order concept by letting 27 and H be th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software Engineering and Applications
سال: 2015
ISSN: 2325-2286,2325-2278
DOI: 10.12677/sea.2015.46016